Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
901	Virtual Proofs of Reality Ulrich R¨uhrmair [removed] Abstract—In this paper, we discuss the question how physical statements can be proven remotely over digital communication Add to Reading List Source URL: cryptome.org Language: English - Date: 2014-06-06 08:08:31 Complexity classes Computational complexity theory Interactive proof system Physical Unclonable Function IP Zero-knowledge proof NP NEXPTIME Challenge-response authentication Cryptography Cryptographic protocols Applied mathematics
902	Specimen Magazine Issue 1 Final Edits Add to Reading List Source URL: specimenmagazine.org Language: English - Date: 2013-01-17 09:50:08 Complexity classes Models of computation Open problems Mathematical optimization SL Theory of computation Computational complexity theory Algorithm Undecidable problem Theoretical computer science Applied mathematics Mathematics
903	Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:46:04 Graph theory NP-complete problems Complexity classes Morphisms Graph coloring Graph homomorphism Matching P versus NP problem Vertex cover Theoretical computer science Mathematics Computational complexity theory
904	Graph Homomorphisms with Complex Values: A Complete Dichotomy Theorem Jin-Yi Cai University of Wisconsin, Madison Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-14 02:22:40 Graph theory NP-complete problems Graph coloring Constraint programming Complexity classes 2-satisfiability Graph homomorphism NP-complete Matching Theoretical computer science Mathematics Computational complexity theory
905	A reprint from American Scientist the magazine of Sigma Xi, The Scientific Research Society Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-12-13 00:24:46 Complexity classes Mathematical optimization Linear algebra Permutations Matching NP-complete Holographic algorithm Computing the permanent FKT algorithm Theoretical computer science Mathematics Computational complexity theory
906	Progress in Computational Complexity Theory Hong Zhu† Computer Sciences Department, Fudan University Shanghai[removed], China. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-02-17 15:41:40 Complexity classes Probabilistic complexity theory Analysis of algorithms Finite fields NP-complete NP Randomized algorithm P Lattice problem Theoretical computer science Computational complexity theory Applied mathematics
907	Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-09-05 18:26:13 NP-complete problems Complexity classes Holographic algorithm NP-complete Matching FKT algorithm NP-hard P versus NP problem NP Theoretical computer science Computational complexity theory Mathematics
908	On Proving Circuit Lower Bounds Against PH and Some Related Lower Bounds for Constant Depth Circuits Jin-Yi Cai 1 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2003-03-05 08:33:15 Complexity classes Circuit complexity Pseudorandomness Pseudorandom generator theorem PP Pseudorandom generator P NC Boolean circuit Theoretical computer science Computational complexity theory Applied mathematics
909	Referential Opacity In Nondeterministic Data Re nement Xiaolei Qian and Allen Goldbergy Kestrel Institute August 3, 1992 Abstract Add to Reading List Source URL: www.agoldberg.org Language: English - Date: 2008-11-03 13:00:01 NL FO Modal logic Theoretical computer science Complexity classes Logic

UPDATE